Adaptive beamforming method for smart antenna system

ABSTRACT

An adaptive beamforming method for an antenna array is provided in which an array output is calculated based on a weight vector  w , which is determined from an eigenvector corresponding to a maximum eigenvalueλ of a generalized eigenvalue problem consisting of autocovariance matrixes  R   xx  and  R   yy  of received signal vectors  y  and  x , respectively. The present invention dramatically decreases the total computation requirements by omitting complex matrix operations from the weight vector calculation, thereby making it possible to reduce the weight vector calculation time so as to form the beam pattern for the array antenna system in real time.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a smart antenna system and, in particular, to an improved adaptive beamforming method for an antenna array in a Code Division Multiple Access (CDMA) communication system.

2. Background of the Related Art

In wireless communication systems, various diverse methods are used for increasing the coverage area and capacity of the system.

Rake receiver architecture provides an effective immunity to the inter-symbol interference (ISI) in multipath propagation environments, which cause the same signal to be repeatedly received at an antenna at a plurality of different time intervals.

Recently, directive antennas have been employed to increase the signal-to-interference plus noise ratio (SINR) by increasing the energy radiated to a desired mobile terminal, while simultaneously reducing the interference energy radiated to other remote mobile terminals. Such reduction in the interference energy radiated to mobile terminals can be achieved by generating spatially selective, directive transmission beam patterns.

One directive antenna technique is adaptive beamforming, in which the beam pattern produced by beamforming antenna arrays of the base station adapts in response to changing multipath conditions. In such beamforming arrays, weight vectors are used to generate on antenna beam pattern that maximizes signal energy transmitted to and received from an intended mobile terminal.

There are a number of algorithms presently in use for calculating the weight vectors. These algorithms rely on adjusting the weight vector so as to track the more slowly changing components of the received signal and assume that more rapidly changing random signal components are removed by integration and are hence not tracked.

These algorithms update the weight vector based on a generalized eigenvalue problem, and the generalized eigenvalue problem is converted so as to be an ordinary eigenvalue problem. Continuously, a positive definite matrix is taken among two matrixes consisting of the generalized eigenvalue problem, and the positive definite matrix is written with two matrixes such that an inverse matrix should be obtained from one of the two written matrixes.

However, the conventional algorithms have a drawback in that the weight vector calculation is so complicated and time-consuming that it is not appropriate for an array antenna system that requires real time environment adaptation.

SUMMARY OF THE INVENTION

An object of the invention is to solve at least the above problems and/or disadvantages and to provide at least the advantages described hereinafter.

It is an object of the present invention to provide an adaptive beamforming method capable of reducing total computational load for computing weight vector.

It is another object of the present invention to provide an adaptive beamforming method capable of maximizing the Signal to Interference plus Noise (SINR).

To achieve the above objects, the adaptive beamforming method of the present invention comprises the steps of setting an initial weight vector w; updating present autocovariance matrixes R _(xx) and R _(yy) of the generalized eigenvalue problem with the signal vectors y and x at a present snapshot; obtaining diagonal and off-diagonal matrixes of one of the autocovariance matrixes R _(xx) and R _(yy); computing the maximum eigenvalue λ using the weight vector w, the autocovariance matrixes R _(xx) and R _(yy) at the present snapshot, and the diagonal and off-diagonal matrixes; and updating the weight vector using the present weight vector w, the eigenvalue λ, and autocovariance matrixes R _(xx) and R _(yy).

The diagonal matrix is a matrix whose diagonal elements are identical to diagonal elements of a square matrix and whose off-diagonal elements are zero, and the off-diagonal matrix is a matrix whose diagonal elements are zero and whose off-diagonal elements are identical to off-diagonal elements of the square matrix.

In one aspect of the present invention, the diagonal and off-diagonal matrixes are R _(xx) ^(D) and R _(xx) ^(O) derived from the autocovariance matrix R _(xx).

The maximum eigenvalue λ is calculated in accordance with the following equation: ${\lambda = \frac{{\underset{\_}{w}}^{H}{\underset{\underset{\_}{\_}}{R}}_{yy}\quad \underset{\_}{w}}{{\underset{\_}{w}}^{H}{\underset{\underset{\_}{\_}}{R}}_{xx}\quad \underset{\_}{w}}}\quad$

where H is the Hermitian operator.

The weight vector w is updated in accordance with the following equation: ${\underset{\_}{w}\left( {k + 1} \right)} = \frac{\left\lbrack {{{{\underset{\underset{\_}{\_}}{R}}_{yy}(k)}\left( {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right)^{- 1}} - {\lambda {{\underset{\underset{\_}{\_}}{R}}_{xx}^{O}(k)}\left( {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right)^{- 1}}} \right\rbrack {\underset{\_}{w}(k)}}{\lambda}$

where k is a snapshot index for receiving the signal vector and for updating the weight vector.

The maximum eigenvalue λ(k) at the present snapshot is computed in accordance with the following equation: ${\lambda (k)} = \frac{\lambda_{nom}(k)}{\lambda_{den}(k)}$

where nom denotes numerator and den denotes denominator,

λ_(nom)(k)=ƒλ_(nom)(k−1)+|α(k)|², and λ_(den)(k)=ƒλ_(den)(k−1)+|β(k)|².

α(k) is obtained in accordance with α(k)=y ^(H)(k)w(k), and β(k) is obtained in accordance with β(k)=x ^(H)(k)w(k).

The weight vector is updated in accordance with the following equation:

w (k+1)= w (k)+ o (k),

where ${\underset{\_}{o}(k)} = {{\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right\rbrack^{- 1}\left\lbrack {{\frac{1}{\lambda \quad (k)}{\underset{\_}{v}(k)}} - {\underset{\_}{q}(k)}} \right\rbrack}.}$

v(k) is obtained in accordance with the following equation: $\begin{matrix} {{\underset{\_}{v}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {\underset{\_}{y}(k)} + {{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}\left( {k - 1} \right)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{{\underset{\_}{w}(k)}.}}}} \\ {\approx {{f\quad {\underset{\_}{v}\left( {k - 1} \right)}} + {{\alpha (k)}{{\underset{\_}{y}(k)}.}}}} \end{matrix}$

q(k) is obtained in accordance with the following equation: $\begin{matrix} {{\underset{\_}{q}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{{\underset{\_}{w}(k)}.}}}} \\ {\approx {{f\quad {\underset{\_}{q}\left( {k - 1} \right)}} + {\beta \quad (k){{\underset{\_}{x}(k)}.}}}} \end{matrix}$

In another aspect of the present invention, the diagonal and off-diagonal matrixes are R _(yy) ^(D) and R _(yy) ^(O) derived from the autocovariance matrix R _(yy).

The maximum eigenvalue λ is calculated in accordance with the following equation: ${\lambda = \frac{{\underset{\_}{w}}^{H}{\underset{\underset{\_}{\_}}{R}}_{yy}\quad \underset{\_}{w}}{{\underset{\_}{w}}^{H}{\underset{\underset{\_}{\_}}{R}}_{xx}\quad \underset{\_}{w}}}\quad$

where H is the Hermitian operator.

The weight vector w is updated in accordance with the following equation:

w (k+1)= w (k)+ p (k)

where p(k)=[R _(yy) ^(D)(k)]⁻¹[λ(k)γ(k)−η(k)].

γ(k) is obtained in accordance with the following equation: $\begin{matrix} {{\underset{\_}{\gamma}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f\quad {\underset{\_}{\gamma}\left( {k - 1} \right)}} + {\beta \quad (k){\underset{\_}{x}(k)}}}} \end{matrix}$

where β(k)=x ^(H)(k)w(k).

η(k) is obtained in accordance with the following equation: $\begin{matrix} {{\underset{\_}{\eta}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f\quad {\underset{\_}{\eta}\left( {k - 1} \right)}} + {\alpha \quad (k){\underset{\_}{y}(k)}}}} \end{matrix}$

where α(k)=y ^(H)(k)w(k).

To achieve at least the above objects, in whole or in part, there, is provided a method for updating a weight factor for input signals from a plurality of antennas of a wireless communication system, including setting an initial weight vector for weighting the input signals, separating desired signals from the input signals, obtaining auto-covariance matrixes of the separated desired signals and the input signals, respectively, computing an eigenvalue that maximizes a ratio of a vector that is a multiplication of the auto-covariance matrix of the separated desired signals and the initial weight vector over a vector that is a multiplication of the auto-covariance matrix of the input signals and the initial weight vector, generating a new weight vector by adding a vector to the initial weight vector, wherein said added vector is proportional to the multiplication of the inverse of a diagonal matrix of the auto-covariance matrix of the input signals and a vector made from the multiplication of a vector of the separated signals and the initial weight vector and the inverse of the eigenvalue.

To achieve at least these advantages, in whole or in part, there is further provided a method for updating a weight factor for input signals from a plurality of antennas of a wireless communication system, including setting an initial weight vector for weighting the input signals, separating desired signals from the input signals, obtaining auto-covariance matrixes of the separated desired signals and the input signals, respectively, computing an eigenvalue that maximizes a ratio of a vector that is a multiplication of the auto-covariance matrix of the separated desired signals and the initial weight vector over a vector that is a multiplication of the auto-covariance matrix of the input signals and the initial weight vector, generating a new weight vector by adding a vector to the initial weight vector, wherein said added vector is proportional to the multiplication of the inverse of a diagonal matrix of the auto-covariance matrix of the separated desired signals and a vector made from the multiplication of a vector of the input signals and the initial weight vector and the eigenvalue.

To achieve at least these advantages, in whole or in part, there is further provided a method for updating a maximum eigenvalue for generating a weight factor for weighting the signals from a plurality of antennas of a wireless communication system, including setting an initial weight vector for weighting the input signals, separating desired signals from the input signals, generating a first value by multiplying the Hermitian of a vector of the separated desired signals and the weight vector, generating a second value by multiplying the Hermitian of a vector of the input signals, computing a numerator of a new maximum eigenvalue by adding a square of said first value to a portion of a numerator of a previous maximum eigenvalue, computing a denominator of the new maximum eigenvalue by adding a square of said second value to a portion of a denominator of the previous maximum eigenvalue; and replacing the previous maximum eigenvalue with the new maximum eigenvalue having said numerator and denominator.

To achieve at least these advantages, in whole or in part, there is further provided an adaptive beam forming method for a communication receiver that inputs signals from an antenna array, including separating desired signals from the input signals, calculating a maximum eigenvalue by defining it as a portion of a numerator and a portion of a denominator, calculating a weight vector using said maximum eigenvalue, said desired signals, and said input signals, and weighting signals from or to a plurality antennas in said antenna array with the weight vector.

To achieve at least these advantages, in whole or in part, there is further provided a method of obtaining a maximum eigenvalue for deriving a weight vector for weighting input signals from a plurality of antennas, including separating desired signals from the input signals, setting an initial weight vector for weighting the input signals, generating a first value based on a Hermitian of a vector of the separated desired signals, generating a second value based on a Hermitian of a vector of the input signals, and deriving the maximum eigenvalue from the first and second values.

To achieve at least these advantages, in whole or in part, there is further provided a method of updating a weight vector for weighting input signals from a plurality of antennas, including setting an initial weight vector for weighting the input signals, separating desired signals from the input signals, deriving an auto-covariance matrix of the separated desired signals, deriving an auto-covariance matrix of the input signals, deriving a maximum eigenvalue using the auto-covariance matrix of the separated desired signals, the auto-covariance matrix of the input signals and the initial weight vector; and deriving a new weight vector by adding a vector to the initial weight vector, wherein the added vector is based on a vector of the separated signals, a vector of the input signals, the initial weight vector, the maximum eigenvalue, and one of the auto-covariance matrix of the input signals and the auto-covariance matrix of the separated desired signals.

To achieve at least these advantages, in whole or in part, there is further provided an adaptive beam forming method, including receiving input signals from a plurality of antennas, separating desired signals from the input signals, setting an initial weight vector for weighting the input signals, generating a first value based on a Hermitian of a vector of the separated desired signals, generating a second value based on a Hermitian of a vector of the input signals, and deriving the maximum eigenvalue from the first and second values, deriving a weight vector using the separated desired signals, the input signals and the derived maximum eigenvalue, and applying the weight vector to the input signals or to signals being sent to the plurality of antennas.

Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objects and advantages of the invention may be realized and attained as particularly pointed out in the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be described in detail with reference to the following drawings in which like reference numerals refer to like elements wherein:

FIG. 1 is a block diagram illustrating a beamforming apparatus for an array antenna system, in accordance with the present invention;

FIG. 2 is a flowchart illustrating an adaptive beamforming method according to a first preferred embodiment of the present invention; and

FIG. 3 is a flowchart illustrating an adaptive beamforming method according to a second preferred embodiment of the present invention.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Preferred embodiments of the present invention will be described hereinafter with reference to the accompanying drawings.

First Preferred Embodiment

FIG. 1 is a schematic block diagram illustrating a general beamforming apparatus for an array antenna system.

As shown in FIG. 1, the array antenna system includes a down converter unit 101, analog-digital converter unit (ADC) 102, a despreading unit 103 having a first multiplication unit 104 and an integration unit 105, a second multiplier unit 106, a beamformer 107, an array output unit 108.

High frequency signals received through respective antennas (ANT) are processed through respective demodulation processes. The signal received from each antenna (ANT) is down-converted into baseband signals by a respective down converter, e.g., down converter 101 a, of the down converter unit 101. The down-converted baseband signal is sent to a respective ADC, e.g., ADC 102 a, of the ADC unit 102 so as to be converted into a digital signal. The digital signal is despreaded by the despreading unit 103 and then the output signal from the despreading unit 103 is multiplied by a weight vector w produced by the beamformer 107 at a respective multiplier, e.g., multiplier 106 a, of the second multiplier unit 106. Consequently, the respective output signals of the multipliers 106 a of the second multiplier 106 are summed by the array output unit 108 such that the output signal of the array output unit 108 is provided to a demodulator (not shown).

The beamformer 107 calculates the weight vector w using the signals obtained at the output and input of the despreading unit 103, respectively. Note that the input signal includes the interferences and noise, as well as the desired signal. The interferences and noise, as undesired signals, are removed through the multiplication and integration procedure at the first multiplication unit 104 and the integration unit 105.

As described above, the beamformer 106 uses the high frequency signal x before despreading and the baseband signal y that is despreaded by multiplying by a canalization code that is known to the receiving end and that has undergone noise removal by integration. The beamformer 106 calculates the weight vector w using autocovariance matrixes obtained from the pre-despread signal x and post-despread signal y.

The weight vector w can be found from the eigenvector corresponding to the largest eigenvalue of the following generalized eigenvalue problem:

R _(yy) w=λR _(xx) w   (1)

where R _(yy) and R _(xx) are the autocovariance matrixes of the received signals y and x, respectively, with y and x being the column vectors of the received signals obtained at the output and input of the despreading unit 103, respectively.

The autocovariance matrixes R _(xx) and R _(yy) are estimated in accordance with the following equations:

R _(xx)(k)=ƒ R _(xx)(k−1)+ x (k) x ^(H)(k)  (2)

R _(yy)(k)=ƒ R _(yy)(k−1)+ y (k) y ^(H)(k)  (3)

where ƒ is a forgetting factor that is predetermined and has a value 0≦ƒ≦1, and the superscript H is a Hermitian operator.

Equation (1) can be written as follows:

R _(yy) w =λ( R _(xx) ^(D) +R _(xx) ^(O)) w   (4)

In equation (4), R _(xx) ^(D) is a matrix whose diagonal elements are identical to those of R _(xx) and whose off-diagonal elements are zero, and R _(xx) ^(O) is a matrix whose diagonal elements are zero and whose off-diagonal elements are identical to those of R _(xx).

Note that the number of elements of the vector x of the received signals obtained at the input of the despreading unit 103 is equal to or less than the number of antenna elements in the array antenna system. The number of the row or column elements of the autocovariance matrix R _(xx) or R _(yy) is equal to the number of elements of the vector x of the received signals. Equation (4) can be rewritten as follows:

R _(yy) w−λR _(xx) ^(O) =λR _(xx) ^(D) w   (5)

From equation (5), the following equation can be found with the inverse matrix of R _(xx) ^(D):

( R _(yy) −λR _(xx) ^(O))( R _(xx) ^(D))⁻¹ w=λw   (6)

The inverse matrix of R _(xx) ^(D) can be easily calculated, since R _(xx) ^(D) is the diagonal matrix.

Exemplary, R _(xx) ^(D) and its inverse matrix (R _(xx) ^(D))⁻¹ can be expressed as follows: $\begin{matrix} {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D} = \begin{bmatrix} D_{1} & 0 & \ldots & 0 \\ 0 & D_{2} & \ldots & 0 \\ \vdots & \vdots & \cdots & \vdots \\ \quad & \quad & \cdots & \quad \\ 0 & 0 & \cdots & D_{L} \end{bmatrix}} & (7) \\ {\left( {\underset{\underset{\_}{\_}}{R}}_{xx}^{D} \right)^{- 1} = \begin{bmatrix} D_{1}^{- 1} & 0 & \ldots & 0 \\ 0 & D_{2}^{- 1} & \ldots & 0 \\ \vdots & \vdots & \cdots & \vdots \\ \quad & \quad & \cdots & \quad \\ 0 & 0 & \cdots & D_{L}^{- 1} \end{bmatrix}} & (8) \end{matrix}$

From equation (6), the eigenvalue λ is obtained as follows: $\begin{matrix} {\lambda = {\frac{{\underset{\_}{w}}^{H}{\underset{\underset{\_}{\_}}{R}}_{yy}\underset{\_}{w}}{{\underset{\_}{w}}^{H}{\underset{\underset{\_}{\_}}{R}}_{xx}\underset{\_}{w}}\quad {\underset{\underset{\_}{\_}}{R}}_{yy}\quad {\underset{\underset{\_}{\_}}{R}}_{xx}{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}\quad {\underset{\underset{\_}{\_}}{R}}_{xx}^{O}}} & (9) \end{matrix}$

Thus, the weight vector w can be expressed as follows: $\begin{matrix} {\underset{\_}{w} = \frac{\left\lfloor {{{\underset{\underset{\_}{\_}}{R}}_{yy}\quad \left( {\underset{\underset{\_}{\_}}{R}}_{xx}^{D} \right)^{- 1}} - {\lambda \quad {{\underset{\underset{\_}{\_}}{R}}_{xx}^{O}\left( {\underset{\underset{\_}{\_}}{R}}_{xx}^{D} \right)}^{- 1}}} \right\rfloor \underset{\_}{w}}{\lambda}} & (10) \end{matrix}$

In equation (10), the number of elements of the weight vector w is equal to the number of rows or columns of the autocovariance matrix R _(xx) or R _(yy).

Since the weight vector w should be continuously updated and the signals are shortly inputted, equation 10 can be transposed as follows: $\begin{matrix} {{{\underset{\_}{w}\left( {k + 1} \right)} = \frac{\left\lfloor {{{{\underset{\underset{\_}{\_}}{R}}_{yy}(k)}\left( {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right)^{- 1}} - {\lambda \quad {{\underset{\underset{\_}{\_}}{R}}_{xx}^{O}(k)}\left( {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right)^{- 1}}} \right\rfloor {\underset{\_}{w}(k)}}{\lambda}},} & (11) \end{matrix}$

where k is a snapshot index to receive the signal vector and to update the weight vector.

Using equation (11), the weight vector is continuously updated so as to track the movement of the signal source and produce an optimal beam pattern for the signal source.

An array output z is calculated by taking the signal vector y and inner product from the weight vector w as follows:

z=w ^(H) y   (12)

In the present invention, the beamforming method can be selectively implemented so as to minimize computation time or to minimize the occurrence of errors. Accordingly, equation (9) for calculating the maximum eigenvalue can be simplified without matrix operations as follows: $\begin{matrix} {{{\lambda (k)} = \frac{\lambda_{nom}(k)}{\lambda_{den}(k)}},} & (13) \end{matrix}$

where nom denotes numerator and den represents denominator.

In equation (13), λ_(nom) (k) can be expressed as follows: $\begin{matrix} \begin{matrix} {{\lambda_{nom}(k)} = {{{\underset{\_}{w}}^{H}(k)}{\underset{\underset{\_}{\_}}{R}}_{xx}\quad (k){\underset{\_}{w}(k)}}} \\ {= {{{\underset{\_}{w}}^{H}(k)}\left\lfloor {{f{\underset{\underset{\_}{\_}}{R}}_{yy}\quad \left( {k - 1} \right)} + {{\underset{\_}{y}(k)}{\underset{\_}{y}(k)}^{H}}} \right\rfloor {\underset{\_}{w}(k)}}} \\ {= {{f{{\underset{\_}{w}}^{H}(k)}{\underset{\underset{\_}{\_}}{R}}_{yy}\quad \left( {k - 1} \right){\underset{\_}{w}(k)}} + {{{\underset{\_}{w}}^{H}(k)}{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f{{\underset{\_}{w}}^{H}\left( {k - 1} \right)}{\underset{\underset{\_}{\_}}{R}}_{yy}\quad \left( {k - 1} \right){\underset{\_}{w}\left( {k - 1} \right)}} + {{\underset{\_}{w}}^{H}\quad {\underset{\_}{y}(k)}\quad {{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \end{matrix} & (14) \end{matrix}$

Note the snapshot cycle for updating the weight vector is very short such that w(k)≈w(k−1) is assumed.

Here, if y ^(H)(k)w(k) is given as α(k), equation (14) can be expressed as follows:

λ_(nom)(k)=ƒλ_(nom)(k−1)+|α(k)|²  (15)

In the same manner, λ_(den)(k) can be expressed as follows:

λ_(den)(k)=ƒλ_(den)(k−1)+|β(k)|²  (16)

where β(k) is given for x ^(H)(k)w(k).

How to simplify the beamforming algorithm using equation (13) will be described hereinafter.

Equation 11 can be rewritten as the following equation (17), since R _(xx) ^(O) is identical to R _(xx)(k)−R _(xx) ^(D)(k): $\begin{matrix} {{\underset{\_}{w}\left( {k + 1} \right)} = {{\underset{\_}{w}(k)} + \frac{{\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right\rbrack^{- 1}\left\lbrack {{{\underset{\underset{\_}{\_}}{R}}_{yy}(k)} - {{\lambda (k)}{{\underset{\underset{\_}{\_}}{R}}_{xx}(k)}}} \right\rbrack}{\underset{\_}{w}(k)}}{\lambda \quad (k)}}} & (17) \end{matrix}$

From equation 17, $\frac{{\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}\quad (k)} \right\rbrack^{- 1}\left\lbrack {{{\underset{\underset{\_}{\_}}{R}}_{yy}(k)} - {{\lambda (k)}\quad {{\underset{\underset{\_}{\_}}{R}}_{xx}(k)}}} \right\rbrack}{\underset{\_}{w}(k)}}{\lambda (k)}$

is given as o(k) as follows: $\begin{matrix} {{\underset{\_}{o}(k)} = \frac{{\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right\rbrack^{- 1}\left\lbrack {{{\underset{\underset{\_}{\_}}{R}}_{yy}(k)} - {{\lambda (k)}{{\underset{\underset{\_}{\_}}{R}}_{xx}(k)}}} \right\rbrack}{\underset{\_}{w}(k)}}{\lambda \quad (k)}} & (18) \end{matrix}$

Equation (18) can be developed as follows: $\begin{matrix} \begin{matrix} {{\underset{\_}{o}(k)} = {{\frac{\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right\rbrack^{- 1}}{\lambda \quad (k)}\left\lbrack {{{\underset{\underset{\_}{\_}}{R}}_{yy}\quad (k)} - {{\lambda (k)}{\underset{\underset{\_}{\_}}{R}}_{xx}\quad (k)}} \right\rbrack}{\underset{\_}{w}(k)}}} \\ {= {{\frac{\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right\rbrack^{- 1}}{\lambda \quad (k)}\left\lbrack {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}} - {{\lambda (k)}\left\lbrack {{f{\underset{\underset{\_}{\_}}{R}}_{xx}\quad \left( {k - 1} \right)} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}}} \right\rbrack}} \right\rbrack}{\underset{\_}{w}(k)}}} \\ {= {\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right\rbrack^{- 1}\left\lbrack {{\frac{1}{\lambda \quad (k)}\left\lbrack {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{y(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}} \right\rbrack} - {f{{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} - {{x(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}}} \right\rbrack}} \end{matrix} & (19) \end{matrix}$

From equation (19), if ƒR _(yy)(k−1)w(k)+y(k)y ^(H)(k)w(k) is given as v(k), v(k) can be developed as follows: $\begin{matrix} \begin{matrix} {{\underset{\_}{v}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}\left( {k - 1} \right)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f\quad {\underset{\_}{v}\left( {k - 1} \right)}} + {\alpha \quad (k){\underset{\_}{y}(k)}}}} \end{matrix} & (20) \end{matrix}$

The initial value of v(k) can be expressed as follows.

v (0)=α(0) y (0)  (21)

In the same manner, ƒR _(xx)(k−1)w(k)+x(k)x ^(H)(k)w(k) is given as q(k), q(k) can be developed as follows: $\begin{matrix} \begin{matrix} {{\underset{\_}{q}(k)} = {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {{\approx {{f\quad {\underset{\_}{q}\left( {k - 1} \right)}} + {{\beta (k)}{\underset{\_}{x}(k)}}}}} \end{matrix} & (22) \end{matrix}$

The initial value of q(k) can be expressed as follows:

q (0)=β(0) x (0)  (23)

From equations (20) and (22), equation (19) can be simplified as the following equation (24): $\begin{matrix} {{\underset{\_}{o}(k)} = {\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right\rbrack^{- 1}\left\lbrack {{\frac{1}{\lambda (k)}{\underset{\_}{v}(k)}} - {\underset{\_}{q}(k)}} \right\rbrack}} & (24) \end{matrix}$

It is noted that equation (24) is simpler than equation (19), even though the matrix operation [R _(xx) ^(D)(k)]⁻¹ remains. This is because, since the matrix operation [R _(xx) ^(D)(k)]⁻¹ is the inverse matrix of the diagonal matrix, the computation requirements of this matrix operation is actually equal to that of a vector equation. That is, the total amount of the required computation for obtaining the weight vector is simplified by omitting the matrix operations.

FIG. 2 is a flowchart simply illustrating the above-explained adaptive beamforming method, according to the first embodiment of the present invention.

As shown in FIG. 2, the beamformer 107 sets the initial guess as v(0)=α(0)y(0) and q(0)=β(0)x(0) at step S10. If the signals x and y are received from the input and output of the despreading unit 103, the beamformer 107 generates signal vectors x(k) and y(k), respectively, at step S11, and updates the generalized eigenvalue by updating the numerator and denominator of the eigenvalue with respective y ^(H)(k)w(k)(=α(k)) and x ^(H)(k)w(k)(=β(k)) derived from the signal vectors x(k) and y(k) at step S12. The updated numerator and denominator are presented as equations (15) and (16).

Sequentially, the beamformer 107 updates the weight vector using the updated eigenvalue at step S13. Here, the weight vector update is performed by reflecting the component o(k), defined as equation (24), to the weight vector at the present snapshot. o(k) can be obtained using the diagonal elements of the autocovariance matrix of the received signal vector, the updated eigenvalue, and v(k) and q(k) updated from their respective initial values of v(0)=α(0)y(0) and q(0)=β(0)x(0). In other words, o(k) is calculated using v(k−1) and q(k−1) obtained at the previous snapshot, and α(k)y(k) and β(k)x(k) obtained at the present snapshot.

Second Preferred Embodiment

FIG. 3 is a flowchart illustrating an adaptive beamforming method, according to another preferred embodiment of the present invention.

In this embodiment, the weight vector is calculated using R _(yy) ^(D) whose diagonal elements are identical to those of R _(yy) and whose off-diagonal elements are zero, and R _(yy) ^(O) whose diagonal elements are zero and whose off-diagonal elements are identical to those of R _(yy).

Accordingly, equation (1) can be written as follows:

( R _(yy) ^(D) +R _(yy) ^(O)) w=λR _(xx) w   (25)

Note that the number of elements of the vector x of the received signals obtained at the input of the despreading unit 103 is equal to or less than the number of antenna elements in the array antenna system. The number of the row or column elements of the autocovariance matrixes R _(xx) or R _(yy) is equal to the number of elements of the vector x of the received signals.

Equation (25) can be rewritten as follows:

( R _(yy) ^(D) w )=λ R _(xx) w−R _(yy) w   (26)

From equation (26), the weight vector can be expressed as follows with the inverse matrix of R _(yy) ^(D):

w =(λ R _(xx) w−R _(yy) ^(O) w ) ( R _(yy) ^(D))⁻¹  (27)

where the generalized eigenvalue λ can be obtained by equation (9) as in the first embodiment. In equation (27), the number of elements of the weight vector w is equal to the number of rows or columns of the autocovariance matrix (R _(xx) or R _(yy)).

The weight vector, updated using the eigenvalue obtained from equations (9) and (27), can be expressed as follows:

w (k+1)=( R _(yy) ^(D)(k))⁻¹ [λR _(xx)(k) w (k)− R _(yy) ^(O)(k) w (k)]  (28)

Equation (28) can be rewritten as follows without matrix operations:

w (k+1)= w (k)+[ R _(yy) ^(D)(k)]⁻¹[λ(k) R _(xx)(k)− R _(yy)(k)] w (k)  (29)

If [R _(yy) ^(D)(k)]⁻¹[λ(k)R _(xx)(k)−R _(yy)(k)]w(k) is taken as p(k), equation (29) can be expressed as follows:

w (k−1)= w (k)+ p (k)  (30)

Accordingly, equation (30) can be developed as follows: $\begin{matrix} \begin{matrix} {{\underset{\_}{p}(k)} = {{\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{yy}^{D}(k)} \right\rbrack^{- 1}\left\lbrack {{{\lambda (k)}{{\underset{\underset{\_}{\_}}{R}}_{xx}(k)}} - {{\underset{\underset{\_}{\_}}{R}}_{yy}(k)}} \right\rbrack}{\underset{\_}{w}(k)}}} \\ {= {{\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{yy}^{D}(k)} \right\rbrack^{- 1}\left\lbrack {{{\lambda (k)}\left\lbrack {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}}} \right\rbrack} - {f\quad {{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}} - {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}}} \right\rbrack}{\underset{\_}{w}(k)}}} \\ {= {\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{yy}^{D}(k)} \right\rbrack^{- 1}\left\lbrack {{{\lambda (k)}\left\lbrack {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}}} \right\rbrack} - {f\quad {{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} - {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}} \right\rbrack}} \end{matrix} & (31) \end{matrix}$

If ƒR _(xx)(k−1)w(k)+x(k)x ^(H)(k)w(k) is given as γ(k), then γ(k) can be developed as follows: $\begin{matrix} \begin{matrix} {{\underset{\_}{\gamma}(k)} = {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {{\approx {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}\left( {k - 1} \right)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}}}}} \\ {{\approx {{f\quad {\underset{\_}{\gamma}\left( {k - 1} \right)}} + {{\beta (k)}{\underset{\_}{x}(k)}}}}} \end{matrix} & (32) \end{matrix}$

where β(k) represents x ^(H)(k)w(k).

From equation (32), the initial value of γ(k) can be expressed as follows:

γ(0)=β(0) x (0)  (33)

In the same manner, ƒR _(yy)(k−1)w(k)+y(k)y ^(H)(k)w(k) is given as η(k), and η(k) can be developed as follows: $\begin{matrix} \begin{matrix} {{\underset{\_}{\eta}(k)} = {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {{\approx {{f\quad {\underset{\_}{\eta}\left( {k - 1} \right)}} + {{\alpha (k)}{\underset{\_}{y}(k)}}}}} \end{matrix} & (34) \end{matrix}$

From equation (34), the initial value of η(k) can be expressed as follows:

η(0)=α(0) y (0)  (35)

From equations (32) and (34), equation (31) can be rewritten as follows:

p (k)=[ R _(yy) ^(D)(k)]⁻¹[λ(k)γ(k)−η(k)]  (36)

It is note that equation (36) is simplified in comparison with equation (29) even though the matrix operation [R _(yy) ^(D)(k)]⁻¹ is remained. However, since the matrix operation [R _(yy) ^(D)(k)]⁻¹ is of the inverse matrix of the diagonal matrix such that the computation amount of the matrix operation becomes equal to the equivalent vector equation. That is, the total amount of the required computation for obtaining the weight vector is simplified by omitting the matrix operations.

It is noted that equation (24) is simpler than equation (19), even though the matrix operation [R _(xx) ^(D)(k)]⁻¹ remains. This is because, since the matrix operation [R _(xx) ^(D)(k)]⁻¹ is of the inverse matrix of the diagonal matrix, the computation requirements of this matrix operation is actually equal to that of a vector equation. That is, the total amount of the required computation for obtaining the weight vector is simplified by omitting the matrix operations.

FIG. 3 is a flowchart simply illustrating the above-explained adaptive beamforming method, according to the second embodiment of the present invention.

As shown in FIG. 3, the beamformer 107 sets the initial guess as η(0)=α(0)y(0) and γ(0)=β(0)y(0) at step S20. If the signals x and y are received from the input and output of the despreading unit 103, the beamformer 107 generates signal vectors x(k) and y(k), respectively, at step S21, and updates the eigenvalue by updating the numerator and denominator of the eigenvalue with respective y ^(H)(k)w(k)(=α(k)) and x ^(H)(k)w(k)(=β(k)) derived from the signal vectors x(k) and y(k) at step S22. The updated numerator and denominator are presented as equations (15) and (16).

Continuously, the beamformer 107 updates the weight vector using the updated eigenvalue at step S23. Here, the weight vector update is performed by reflecting the component p(k), defined as equation (36), to the weight vector at the present snapshot. p(k) can be obtained using the diagonal elements of the autocovariance matrix of the received signal vector, the updated eigenvalue, and η(k) and γ(k) updated from their respective initial values of η(0)=α(0)y(0) and γ(0)=β(0)x(0). In other words, p(k) is calculated using η(k−1) and γ(k−1) obtained at the previous snapshot, and α(k)y(k) and β(k)x(k) obtained at the present snapshot.

As described above, in the adaptive beamforming method of the present invention the total amount of the computation is dramatically decreased by omitting the complex matrix operations such that it is possible to reduce weight vector calculation time so as to form the beam pattern for array antenna system in real time.

Also, the simplification of the beamforming algorithm makes possible to reduce the number of the DSPs for the beamformer, resulting in reduction of whole manufacturing costs of the beamformer.

The foregoing embodiments and advantages are merely exemplary and are not to be construed as limiting the present invention. The present teaching can be readily applied to other types of apparatuses. The description of the present invention is intended to be illustrative, and not to limit the scope of the claims. Many alternatives, modifications, and variations will be apparent to those skilled in the art. In the claims, means-plus-function clauses are intended to cover the structures described herein as performing the recited function and not only structural equivalents but also equivalent structures 

What is claimed is:
 1. A method for updating a weight vector for input signals from a plurality of antennas of a wireless communication system, comprising: setting an initial weight vector for weighting the input signals; separating desired signals from the input signals; obtaining auto-covariance matrixes of the separated desired signals and the input signals, respectively; computing an eigenvalue that maximizes a ratio of a vector that is a multiplication of the auto-covariance matrix of the separated desired signals and the initial weight vector over a vector that is a multiplication of the auto-covariance matrix of the input signals and the initial weight vector; generating a new weight vector by adding a vector to the initial weight vector, wherein said added vector is proportional to the multiplication of the inverse of a diagonal matrix of the auto-covariance matrix of the input signals and a vector made from the multiplication of a vector of the separated desired signals and the initial weight vector and the inverse of the eigenvalue.
 2. The method of claim 1, wherein said added vector is calculated by the steps of: generating a first vector which is a multiplication of the Hermitian of a vector of the separated desired signals, the initial weight vector, and a vector of the separated desired signals added to the previous first vector multiplied by a forgetting factor; generating a second vector which is a multiplication of the Hermitian of a vector of the input signals, the initial weight vector, and a vector of the input signals added to the previous first vector multiplied by a forgetting factor; calculating said added vector by, (1) dividing said first vector with said eigenvalue, (2) subtracting said second vector from the divided first vector, and (3) multiplying the result of step (2) by the inverse of a diagonal matrix of the auto-covariance matrix of the input signals.
 3. The method of claim 2, wherein said forgetting factor is predetermined in a transmission interval and has a value from zero to one.
 4. The method of claim 3, wherein said first vector is v(k), wherein: $\begin{matrix} \begin{matrix} {{{\underset{\_}{v}(k)} = {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}\quad {or}}}},} \\ {{{\approx {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}\left( {k - 1} \right)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}\quad {or}}}},}} \\ {{\approx {{f\quad {\underset{\_}{v}\left( {k - 1} \right)}} + {{\alpha (k)}{\underset{\_}{y}(k)}}}}} \end{matrix} & \quad \end{matrix}$

and said second vector is q(k), wherein: $\begin{matrix} {{{\underset{\_}{q}(k)} = {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}\quad {or}}}},} \\ {{\approx {{f\quad {\underset{\_}{q}\left( {k - 1} \right)}} + {{\beta (k)}{{\underset{\_}{x}(k)}.}}}}} \end{matrix}$


5. The method of claim 4, wherein said added vector is o(k), said inverse of a diagonal matrix of the auto-covariance matrix of the input signals is [R_(xx) ^(D)(k)]⁻¹, and said eigenvalue is λ(k), wherein: ${\underset{\_}{o}(k)}{{\left\{ {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right\}^{- 1}\left\lbrack {{\frac{1}{\lambda (k)}{\underset{\_}{v}(k)}} - {\underset{\_}{q}(k)}} \right\rbrack}.}$


6. The method of claim 1, wherein said desired signals are signals despread with a predetermined code from the input signals.
 7. A method for updating the weight vector for input signals from a plurality of antennas of a wireless communication system, comprising: setting an initial weight vector for weighting the input signals; separating desired signals from the input signals; obtaining auto-covariance matrixes of the separated desired signals and the input signals, respectively; computing an eigenvalue that maximizes a ratio of a vector that is a multiplication of the auto-covariance matrix of the separated desired signals and the initial weight vector over a vector that is a multiplication of the auto-covariance matrix of the input signals and the initial weight vector; generating a new weight vector by adding a vector to the initial weight vector, wherein said added vector is proportional to the multiplication of the inverse of a diagonal matrix of the auto-covariance matrix of the separated desired signals and a vector made from the multiplication of a vector of the input signals and the initial weight vector and the eigenvalue.
 8. The method of claim 7, wherein said added vector is calculated by the steps of: generating a first vector which is a multiplication of the Hermitian of a vector of the separated desired signals, the initial weight vector, and a vector of the separated desired signals added to the previous first vector multiplied by a forgetting factor; generating second vector which is a multiplication of the Hermitian of a vector of the input signals, the initial weight vector, and a vector of the input signals added to the previous first vector multiplied by a forgetting factor; calculating said added vector by, (1) multiplying said second vector with said eigenvalue, (2) subtracting said first vector from the multiplied first vector, and (3) multiplying the result of step (2) by the inverse of a diagonal matrix of the auto-covariance matrix of the separated desired signals.
 9. The method of claim 8, wherein said forgetting factor is predetermined in a transmission interval and has a value from zero to one.
 10. The method of claim 9, wherein said second vector is γ(k), wherein: ${{{\underset{\_}{\gamma}(k)} = {{f\quad {{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}\quad {or}}}},{~~~~~~~~~~~~~~~}{\approx {{f\quad {\underset{\_}{\gamma}\left( {k - 1} \right)}} + {{\beta (k)}{\underset{\_}{x}(k)}}}}}\quad$

and said first vector is η(k), wherein: $\begin{matrix} {{{\underset{\_}{\eta}(k)} = {{f{\underset{\underset{\_}{\_}}{R}}_{yy}\quad \left( {k - 1} \right){\underset{\_}{w}(k)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}\quad {or}}}},} \\ {{\approx {{f\quad {\underset{\_}{\eta}\left( {k - 1} \right)}} + {{\alpha (k)}{\underset{\_}{y}(k)}}}}} \end{matrix}$


11. The method of claim 10, wherein said added vector is p(k), said inverse of a diagonal matrix of the auto-covariance matrix of the separated desired signals is [R_(yy) ^(D)(k)]⁻¹, and said eigenvalue is λ(k), wherein: p (k)=[ R _(yy) ^(D)(k)]⁻¹[λ(k)γ(k)−η(k)].
 12. The method of claim 7, wherein said desired signals are signals despread with a predetermined code from the input signals.
 13. A method for updating a maximum eigenvalue for generating a weight vector for weighting input signals from a plurality of antennas of a wireless communication system, comprising: setting an initial weight vector for weighting the input signals; separating desired signals from the input signals; generating a first value by multiplying the Hermitian of a vector of the separated desired signals and the weight vector; generating a second value by multiplying the Hermitian of a vector of the input signals; computing a numerator of a new maximum eigenvalue by adding a square of said first value to a portion of a numerator of a previous maximum eigenvalue; computing a denominator of the new maximum eigenvalue by adding a square of said second value to a portion of a denominator of the previous maximum eigenvalue; and replacing the previous maximum eigenvalue with the new maximum eigenvalue having said numerator and denominator, wherein said first value α(k) is calculated in accordance with the following equation: α(k)=y ^(H)(k)w(k), and wherein said second value β(k) is calculated in accordance with the following equation β(k)=x ^(H)(k)w(k), and wherein said numerator is calculated in accordance with the following equation λ(k)=ƒλ_(nom)(k−1)+|α(k)|²and, said denominator is calculated in accordance with the following equation, λ_(den)(k)=ƒλ_(den)(k−1)+|β(k)|², wherein ƒ is a forgetting factor that is predetermined in a transmission interval and has a value from zero to one.
 14. The method of claim 13, wherein said desired signals are signals despread with a predetermined code from the input signals.
 15. An adaptive beam forming method for a communication receiver that inputs signals from an antenna array, comprising: separating desired signals from the input signals; calculating a maximum eigenvalue as a ratio of a numerator and a denominator; calculating a weight vector using said maximum eigenvalue, said desired signals, and said input signals; and weighting signals from or to a plurality antennas in said antenna array with the weight vector, wherein the maximum eigenvalue λ(k) at a present snapshot is computed in accordance with following equation: ${\lambda (k)} = \frac{\lambda_{nom}(k)}{\lambda_{den}(k)}$

where nom denotes numerator and den denotes denominator, λ_(nom)(k)=ƒλ_(nom)(k−1)+|α(k)|², and λ_(den)(k)=ƒλ_(den)(k−1)+|β(k)|², and k is a snapshot index to receive a signal vector and to update the weight vector.
 16. The adaptive beamforming method of claim 15, wherein α(k) and β(k) are obtained in accordance with the following equations: α(k)=y ^(H)(k)w(k), and β(k)=x ^(H)(k)w(k), where w is a weight vector, y(k) is a vector of the separated desired signals, x(k) is a vector of the input signals, and H is a Hermitian operator.
 17. The adaptive beamforming method of claim 16, wherein the weight vector is updated in accordance with the following equation: w(k+1)=w(k)+o(k) where ${{\underset{\_}{o}(k)} = {\left\lbrack {{\underset{\underset{\_}{\_}}{R}}_{xx}^{D}(k)} \right\rbrack^{- 1}\left\lbrack {{\frac{1}{\lambda (k)}{\underset{\_}{v}(k)}} - {\underset{\_}{q}(k)}} \right\rbrack}},$

and [R_(xx) ^(D)(k)]⁻¹ is an inverse of a diagonal matrix of the auto-covariance matrix of the input signals.
 18. The adaptive beamforming method of claim 17, wherein v(k) is obtained in accordance with the following equation: $\begin{matrix} {{\underset{\_}{v}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}\left( {k - 1} \right)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f{\underset{\_}{v}\left( {k - 1} \right)}} + {{\alpha (k)}{{\underset{\_}{y}(k)}.}}}} \end{matrix}$

and, q(k) is obtained in accordance with the following equation: $\begin{matrix} {{\underset{\_}{q}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f{\underset{\_}{q}\left( {k - 1} \right)}} + {{\beta (k)}{{\underset{\_}{x}(k)}.}}}} \end{matrix}$


19. The adaptive beamforming method of claim 18, wherein q(k) is obtained in accordance with the following equation: $\begin{matrix} {{\underset{\_}{q}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f{\underset{\_}{q}\left( {k - 1} \right)}} + {{\beta (k)}{{\underset{\_}{x}(k)}.}}}} \end{matrix}$


20. The adaptive beamforming method of claim 16, wherein the weight vector w is updated in accordance with the following equation: w(k+1)=w(k)+p(k), where p(k)=[R _(yy) ^(D)(k)]⁻¹[λ(k)y(k)−η(k)]., and where [R_(yy) ^(D)(k)]⁻¹ is an inverse of a diagonal matrix of the auto-covariance matrix of the separated desired signals.
 21. The adaptive beamforming method of claim 20, wherein λ(k) is obtained in accordance with the following equation: $\begin{matrix} {{\underset{\_}{\gamma}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{xx}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{x}(k)}{{\underset{\_}{x}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {{{\approx {{f{\underset{\_}{\gamma}\left( {k - 1} \right)}} + {{\beta (k)}{\underset{\_}{x}(k)}}}},{and}}\quad} \end{matrix}$

η(k) is obtained in accordance with the following equation: $\begin{matrix} {{\underset{\_}{\eta}(k)} = {{f{{\underset{\underset{\_}{\_}}{R}}_{yy}\left( {k - 1} \right)}{\underset{\_}{w}(k)}} + {{\underset{\_}{y}(k)}{{\underset{\_}{y}}^{H}(k)}{\underset{\_}{w}(k)}}}} \\ {\approx {{f{\underset{\_}{\eta}\left( {k - 1} \right)}} + {{\alpha (k)}{{\underset{\_}{y}(k)}.}}}} \end{matrix}$


22. The method of claim 15, wherein said desired signals are signals despread with a predetermined code from the input signals.
 23. A method of updating a weight vector for weighting input signals from a plurality of antennas, comprising: setting an initial weight vector for weighting the input signals; separating desired signals from the input signals; deriving an auto-covariance matrix of the separated desired signals; deriving an auto-covariance matrix of the input signals; deriving an eigenvalue using the auto-covariance matrix of the separated desired signals, the auto-covariance matrix of the input signals and the initial weight vector; and deriving a new weight vector by adding a vector to the initial weight vector, wherein the added vector is based on a vector of the separated signals, a vector of the input signals, the initial weight value, the maximum eigenvalue, and one of the auto-covariance matrix of the input signals and the auto-covanance matrix of the separated desired signals, and wherein the added vector is proportional to the product of: (1) the inverse of a diagonal matrix of the auto-covariance matrix of the input signals; and (2) a vector derived from the product of a vector of the separated desired signals, the initial weight vector, and the inverse of the maximum eigenvalue.
 24. The method of claim 23, wherein the maximum eigenvalue comprises an eigenvalue that maximizes a ratio of a first value to a second value, wherein the first value is defined by a vector that is the product of the auto-covariance matrix of the separated desired signals and the initial weight vector, and the second value is defined by a vector that is the product of the auto-covariance matrix of the input signals and the initial weight vector.
 25. A method of updating a weight vector for weighting input signals from a plurality of antennas, comprising setting an initial weight vector for weighting the input signals; separating desired signals from the input signals; deriving an auto-covariance matrix of the separated desired signals; deriving an auto-covariance matrix of the input signals; deriving an eigenvalue using the auto-covariance matrix of the separated desired signals, the auto-covariance matrix of the input signals and the initial weight vector; deriving a new weight vector by adding a vector to the initial weight vector, wherein the added vector is based on a vector of the separated signals, a vector of the input signals, the initial weight value, the maximum eigenvalue, and one of the auto-covariance matrix of the input signals and the auto-covariance matrix of the separated desired signals, and wherein the added vector is proportional to the product of: (1) the inverse of a diagonal matrix of the auto-covariance matrix of the separated desired signals; and (2) a vector derived from the product of a vector of the input signals, the initial weight vector, and the inverse of the maximum eigenvalue. 